# -*- coding: utf-8 -*-
# author yzs
# date 2019-01-14
#
# 字符串1
# Description
# Given a string ‘str’ of digits, find length of the longest substring of ‘str’,
# such that the length of the substring is 2k digits and sum of left k digits is equal to the sum of right k digits.
# Input
# 输入第一行是测试用例的个数，后面每一行表示一个数字组成的字符串，例如："123123"
# Output
# 输出找到的满足要求的最长子串的长度。例如，给定的例子长度应该是 6。每行对应一个用例的结果。
# Sample Input 1 
# 1
# 1538023
# Sample Output 1
# 4


def find_length(s, n):
    total = [0] * (n + 1)
    for i in range(1, n + 1):
        total[i] = total[i - 1] + int(s[i - 1])
    ans = 0
    l = 2
    while l <= n:
        for i in range(n - l + 1):
            if total[i + l // 2] - total[i] == total[i + l] - total[i + l // 2]:
                ans = max(ans, l)
        l = l + 2
    return ans


while True:
    try:
        t = int(input().strip())
        for i in range(t):
            data = input().strip()
            ans = find_length(data, len(data))
            print(ans)
    except EOFError:
        break
